Technology Portfolio Planning by Weighted Graph Analysis of System Architectures
نویسندگان
چکیده
منابع مشابه
Technology Portfolio Planning by Weighted Graph Analysis of System Architectures
5 Many systems undergo significant architecture-level change throughout their lifecycles in order to adapt to new operating and funding contexts, to react to failed technology development, or to incorporate new technologies. In all cases early architecture selection and technology investment decisions will constrain the system to certain regions of the tradespace, which can limit the evolvabili...
متن کاملA System for Bank Portfolio Planning
Commercial banks and, to a lesser degree, other financial institutions have substantial holdings of various types of federal, state, and local government bonds. At the beginning of 1974, approximately twenty-five percent of the assets of commercial banks were held in these types of securities. Banks hold bonds for a variety of reasons. Basically, bonds provide banks with a liquidity buffer agai...
متن کاملGrid Technology in Financial Planning - A Methodology for Portfolio Structuring
This report outlines the development of a grid-enabled computational methodology for solving the portfolio optimization problem. Unlike the classical treatment of a set of mean-variance optimized portfolios as a deterministic efficient frontier, we adopt a novel treatment of the frontier as a distribution of points on a statistical front. This is made possible by our stochastic algorithms, spec...
متن کاملFast Planning Through Planning Graph Analysis
We introduce a new approach to planning in STRIPS-like domains based on constructing and analysing a compact structure we call a Planning Graph We describe a new planner, Graphplan, that uses this paradigm Graphplan always returns a shortest-possible partial-order plan, or states that no valid plan exists We provide empirical evidence in favor of this approach, showing that Graphplan outperform...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems Engineering
سال: 2014
ISSN: 1098-1241
DOI: 10.1002/sys.21287